TSTP Solution File: NLP267^18 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NLP267^18 : TPTP v8.1.2. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 08:05:12 EDT 2024
% Result : Theorem 0.11s 0.35s
% Output : Refutation 0.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 28
% Syntax : Number of formulae : 84 ( 44 unt; 20 typ; 0 def)
% Number of atoms : 385 ( 74 equ; 0 cnn)
% Maximal formula atoms : 10 ( 6 avg)
% Number of connectives : 420 ( 7 ~; 20 |; 15 &; 345 @)
% ( 0 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Number of types : 4 ( 2 usr)
% Number of type conns : 77 ( 77 >; 0 *; 0 +; 0 <<)
% Number of symbols : 23 ( 19 usr; 10 con; 0-3 aty)
% ( 8 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 101 ( 71 ^ 30 !; 0 ?; 101 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
mindex: $tType ).
thf(type_def_6,type,
mworld: $tType ).
thf(func_def_0,type,
mworld: $tType ).
thf(func_def_1,type,
mindex: $tType ).
thf(func_def_2,type,
mrel: mindex > mworld > mworld > $o ).
thf(func_def_3,type,
'#b_u': mindex ).
thf(func_def_4,type,
'#b_s': mindex ).
thf(func_def_5,type,
mactual: mworld ).
thf(func_def_6,type,
mlocal: ( mworld > $o ) > $o ).
thf(func_def_8,type,
mnot: ( mworld > $o ) > mworld > $o ).
thf(func_def_9,type,
mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_10,type,
mor: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_11,type,
mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_12,type,
mequiv: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_13,type,
mbox: mindex > ( mworld > $o ) > mworld > $o ).
thf(func_def_14,type,
mdia: mindex > ( mworld > $o ) > mworld > $o ).
thf(func_def_20,type,
price: $i > mworld > $o ).
thf(func_def_21,type,
dest: $i > mworld > $o ).
thf(func_def_22,type,
class: $i > mworld > $o ).
thf(func_def_38,type,
sK1: mworld ).
thf(f158,plain,
$false,
inference(trivial_inequality_removal,[],[f156]) ).
thf(f156,plain,
$true = $false,
inference(superposition,[],[f151,f98]) ).
thf(f98,plain,
( $false
= ( price @ seventy @ sK1 ) ),
inference(binary_proxy_clausification,[],[f97]) ).
thf(f97,plain,
( $false
= ( ( mrel @ '#b_s' @ mactual @ sK1 )
=> ( price @ seventy @ sK1 ) ) ),
inference(beta_eta_normalization,[],[f96]) ).
thf(f96,plain,
( $false
= ( ^ [Y0: mworld] :
( ( mrel @ '#b_s' @ mactual @ Y0 )
=> ( price @ seventy @ Y0 ) )
@ sK1 ) ),
inference(sigma_clausification,[],[f95]) ).
thf(f95,plain,
( $true
!= ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ '#b_s' @ mactual @ Y0 )
=> ( price @ seventy @ Y0 ) ) ) ),
inference(beta_eta_normalization,[],[f79]) ).
thf(f79,plain,
( ( ^ [Y0: mworld > $o] : ( Y0 @ mactual )
@ ( ^ [Y0: mindex,Y1: mworld > $o,Y2: mworld] :
( !! @ mworld
@ ^ [Y3: mworld] :
( ( mrel @ Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) )
@ '#b_s'
@ ( price @ seventy ) ) )
!= $true ),
inference(definition_unfolding,[],[f68,f57,f66]) ).
thf(f66,plain,
( mbox
= ( ^ [Y0: mindex,Y1: mworld > $o,Y2: mworld] :
( !! @ mworld
@ ^ [Y3: mworld] :
( ( mrel @ Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) ) ) ),
inference(cnf_transformation,[],[f47]) ).
thf(f47,plain,
( mbox
= ( ^ [Y0: mindex,Y1: mworld > $o,Y2: mworld] :
( !! @ mworld
@ ^ [Y3: mworld] :
( ( mrel @ Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) ) ) ),
inference(fool_elimination,[],[f46]) ).
thf(f46,plain,
( ( ^ [X0: mindex,X1: mworld > $o,X2: mworld] :
! [X3: mworld] :
( ( mrel @ X0 @ X2 @ X3 )
=> ( X1 @ X3 ) ) )
= mbox ),
inference(rectify,[],[f7]) ).
thf(f7,axiom,
( ( ^ [X4: mindex,X0: mworld > $o,X2: mworld] :
! [X5: mworld] :
( ( mrel @ X4 @ X2 @ X5 )
=> ( X0 @ X5 ) ) )
= mbox ),
file('/export/starexec/sandbox/tmp/tmp.Bujw4kP5WJ/Vampire---4.8_32677',mbox_def) ).
thf(f57,plain,
( mlocal
= ( ^ [Y0: mworld > $o] : ( Y0 @ mactual ) ) ),
inference(cnf_transformation,[],[f35]) ).
thf(f35,plain,
( mlocal
= ( ^ [Y0: mworld > $o] : ( Y0 @ mactual ) ) ),
inference(fool_elimination,[],[f1]) ).
thf(f1,axiom,
( ( ^ [X0: mworld > $o] : ( X0 @ mactual ) )
= mlocal ),
file('/export/starexec/sandbox/tmp/tmp.Bujw4kP5WJ/Vampire---4.8_32677',mlocal_def) ).
thf(f68,plain,
( ( mlocal @ ( mbox @ '#b_s' @ ( price @ seventy ) ) )
!= $true ),
inference(cnf_transformation,[],[f56]) ).
thf(f56,plain,
( ( mlocal @ ( mbox @ '#b_s' @ ( price @ seventy ) ) )
!= $true ),
inference(flattening,[],[f55]) ).
thf(f55,plain,
( ( mlocal @ ( mbox @ '#b_s' @ ( price @ seventy ) ) )
!= $true ),
inference(fool_elimination,[],[f54]) ).
thf(f54,plain,
~ ( mlocal @ ( mbox @ '#b_s' @ ( price @ seventy ) ) ),
inference(rectify,[],[f19]) ).
thf(f19,negated_conjecture,
~ ( mlocal @ ( mbox @ '#b_s' @ ( price @ seventy ) ) ),
inference(negated_conjecture,[],[f18]) ).
thf(f18,conjecture,
mlocal @ ( mbox @ '#b_s' @ ( price @ seventy ) ),
file('/export/starexec/sandbox/tmp/tmp.Bujw4kP5WJ/Vampire---4.8_32677',con) ).
thf(f151,plain,
! [X0: mworld] :
( $true
= ( price @ seventy @ X0 ) ),
inference(trivial_inequality_removal,[],[f149]) ).
thf(f149,plain,
! [X0: mworld] :
( ( $true = $false )
| ( $true
= ( price @ seventy @ X0 ) ) ),
inference(superposition,[],[f73,f145]) ).
thf(f145,plain,
! [X1: mworld] :
( ( ( mrel @ '#b_s' @ mactual @ X1 )
= $false )
| ( $true
= ( price @ seventy @ X1 ) ) ),
inference(trivial_inequality_removal,[],[f142]) ).
thf(f142,plain,
! [X1: mworld] :
( ( ( mrel @ '#b_s' @ mactual @ X1 )
= $false )
| ( $true
= ( price @ seventy @ X1 ) )
| ( $true = $false ) ),
inference(backward_demodulation,[],[f137,f141]) ).
thf(f141,plain,
! [X0: mworld] :
( $true
= ( class @ second @ X0 ) ),
inference(trivial_inequality_removal,[],[f138]) ).
thf(f138,plain,
! [X0: mworld] :
( ( $true
= ( class @ second @ X0 ) )
| ( $true = $false ) ),
inference(superposition,[],[f94,f73]) ).
thf(f94,plain,
! [X1: mworld] :
( ( ( mrel @ '#b_s' @ mactual @ X1 )
= $false )
| ( $true
= ( class @ second @ X1 ) ) ),
inference(binary_proxy_clausification,[],[f92]) ).
thf(f92,plain,
! [X1: mworld] :
( ( ( mrel @ '#b_s' @ mactual @ X1 )
= $false )
| ( $true
= ( ( class @ second @ X1 )
& ( dest @ paris @ X1 ) ) ) ),
inference(binary_proxy_clausification,[],[f91]) ).
thf(f91,plain,
! [X1: mworld] :
( $true
= ( ( mrel @ '#b_s' @ mactual @ X1 )
=> ( ( class @ second @ X1 )
& ( dest @ paris @ X1 ) ) ) ),
inference(beta_eta_normalization,[],[f90]) ).
thf(f90,plain,
! [X1: mworld] :
( ( ^ [Y0: mworld] :
( ( mrel @ '#b_s' @ mactual @ Y0 )
=> ( ( class @ second @ Y0 )
& ( dest @ paris @ Y0 ) ) )
@ X1 )
= $true ),
inference(pi_clausification,[],[f89]) ).
thf(f89,plain,
( $true
= ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ '#b_s' @ mactual @ Y0 )
=> ( ( class @ second @ Y0 )
& ( dest @ paris @ Y0 ) ) ) ) ),
inference(beta_eta_normalization,[],[f78]) ).
thf(f78,plain,
( $true
= ( ^ [Y0: mworld > $o] : ( Y0 @ mactual )
@ ( ^ [Y0: mindex,Y1: mworld > $o,Y2: mworld] :
( !! @ mworld
@ ^ [Y3: mworld] :
( ( mrel @ Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) )
@ '#b_s'
@ ( ^ [Y0: mworld > $o,Y1: mworld > $o,Y2: mworld] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) )
@ ( dest @ paris )
@ ( class @ second ) ) ) ) ),
inference(definition_unfolding,[],[f67,f57,f66,f70]) ).
thf(f70,plain,
( mand
= ( ^ [Y0: mworld > $o,Y1: mworld > $o,Y2: mworld] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f32]) ).
thf(f32,plain,
( mand
= ( ^ [Y0: mworld > $o,Y1: mworld > $o,Y2: mworld] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f31]) ).
thf(f31,plain,
( ( ^ [X0: mworld > $o,X1: mworld > $o,X2: mworld] :
( ( X0 @ X2 )
& ( X1 @ X2 ) ) )
= mand ),
inference(rectify,[],[f3]) ).
thf(f3,axiom,
( ( ^ [X1: mworld > $o,X3: mworld > $o,X2: mworld] :
( ( X1 @ X2 )
& ( X3 @ X2 ) ) )
= mand ),
file('/export/starexec/sandbox/tmp/tmp.Bujw4kP5WJ/Vampire---4.8_32677',mand_def) ).
thf(f67,plain,
( ( mlocal @ ( mbox @ '#b_s' @ ( mand @ ( dest @ paris ) @ ( class @ second ) ) ) )
= $true ),
inference(cnf_transformation,[],[f28]) ).
thf(f28,plain,
( ( mlocal @ ( mbox @ '#b_s' @ ( mand @ ( dest @ paris ) @ ( class @ second ) ) ) )
= $true ),
inference(fool_elimination,[],[f27]) ).
thf(f27,plain,
mlocal @ ( mbox @ '#b_s' @ ( mand @ ( dest @ paris ) @ ( class @ second ) ) ),
inference(rectify,[],[f17]) ).
thf(f17,axiom,
mlocal @ ( mbox @ '#b_s' @ ( mand @ ( dest @ paris ) @ ( class @ second ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Bujw4kP5WJ/Vampire---4.8_32677',axiom_5) ).
thf(f137,plain,
! [X1: mworld] :
( ( ( class @ second @ X1 )
= $false )
| ( ( mrel @ '#b_s' @ mactual @ X1 )
= $false )
| ( $true
= ( price @ seventy @ X1 ) ) ),
inference(trivial_inequality_removal,[],[f134]) ).
thf(f134,plain,
! [X1: mworld] :
( ( ( class @ second @ X1 )
= $false )
| ( $true
= ( price @ seventy @ X1 ) )
| ( ( mrel @ '#b_s' @ mactual @ X1 )
= $false )
| ( $true = $false ) ),
inference(backward_demodulation,[],[f111,f133]) ).
thf(f133,plain,
! [X0: mworld] :
( $true
= ( dest @ paris @ X0 ) ),
inference(trivial_inequality_removal,[],[f131]) ).
thf(f131,plain,
! [X0: mworld] :
( ( $true = $false )
| ( $true
= ( dest @ paris @ X0 ) ) ),
inference(superposition,[],[f73,f93]) ).
thf(f93,plain,
! [X1: mworld] :
( ( ( mrel @ '#b_s' @ mactual @ X1 )
= $false )
| ( $true
= ( dest @ paris @ X1 ) ) ),
inference(binary_proxy_clausification,[],[f92]) ).
thf(f111,plain,
! [X1: mworld] :
( ( $true
= ( price @ seventy @ X1 ) )
| ( ( mrel @ '#b_s' @ mactual @ X1 )
= $false )
| ( ( class @ second @ X1 )
= $false )
| ( ( dest @ paris @ X1 )
= $false ) ),
inference(binary_proxy_clausification,[],[f110]) ).
thf(f110,plain,
! [X1: mworld] :
( ( ( mrel @ '#b_s' @ mactual @ X1 )
= $false )
| ( ( ( class @ second @ X1 )
& ( dest @ paris @ X1 ) )
= $false )
| ( $true
= ( price @ seventy @ X1 ) ) ),
inference(binary_proxy_clausification,[],[f109]) ).
thf(f109,plain,
! [X1: mworld] :
( ( ( ( ( class @ second @ X1 )
& ( dest @ paris @ X1 ) )
=> ( price @ seventy @ X1 ) )
= $true )
| ( ( mrel @ '#b_s' @ mactual @ X1 )
= $false ) ),
inference(binary_proxy_clausification,[],[f108]) ).
thf(f108,plain,
! [X1: mworld] :
( ( ( mrel @ '#b_s' @ mactual @ X1 )
=> ( ( ( class @ second @ X1 )
& ( dest @ paris @ X1 ) )
=> ( price @ seventy @ X1 ) ) )
= $true ),
inference(beta_eta_normalization,[],[f107]) ).
thf(f107,plain,
! [X1: mworld] :
( $true
= ( ^ [Y0: mworld] :
( ( mrel @ '#b_s' @ mactual @ Y0 )
=> ( ( ( class @ second @ Y0 )
& ( dest @ paris @ Y0 ) )
=> ( price @ seventy @ Y0 ) ) )
@ X1 ) ),
inference(pi_clausification,[],[f106]) ).
thf(f106,plain,
( $true
= ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ '#b_s' @ mactual @ Y0 )
=> ( ( ( class @ second @ Y0 )
& ( dest @ paris @ Y0 ) )
=> ( price @ seventy @ Y0 ) ) ) ) ),
inference(beta_eta_normalization,[],[f75]) ).
thf(f75,plain,
( $true
= ( ^ [Y0: mworld > $o] : ( Y0 @ mactual )
@ ( ^ [Y0: mindex,Y1: mworld > $o,Y2: mworld] :
( !! @ mworld
@ ^ [Y3: mworld] :
( ( mrel @ Y0 @ Y2 @ Y3 )
=> ( Y1 @ Y3 ) ) )
@ '#b_s'
@ ( ^ [Y0: mworld > $o,Y1: mworld > $o,Y2: mworld] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) )
@ ( ^ [Y0: mworld > $o,Y1: mworld > $o,Y2: mworld] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) )
@ ( dest @ paris )
@ ( class @ second ) )
@ ( price @ seventy ) ) ) ) ),
inference(definition_unfolding,[],[f59,f57,f66,f62,f70]) ).
thf(f62,plain,
( mimplies
= ( ^ [Y0: mworld > $o,Y1: mworld > $o,Y2: mworld] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f49]) ).
thf(f49,plain,
( mimplies
= ( ^ [Y0: mworld > $o,Y1: mworld > $o,Y2: mworld] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f48]) ).
thf(f48,plain,
( ( ^ [X0: mworld > $o,X1: mworld > $o,X2: mworld] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) ) )
= mimplies ),
inference(rectify,[],[f5]) ).
thf(f5,axiom,
( ( ^ [X1: mworld > $o,X3: mworld > $o,X2: mworld] :
( ( X1 @ X2 )
=> ( X3 @ X2 ) ) )
= mimplies ),
file('/export/starexec/sandbox/tmp/tmp.Bujw4kP5WJ/Vampire---4.8_32677',mimplies_def) ).
thf(f59,plain,
( ( mlocal @ ( mbox @ '#b_s' @ ( mimplies @ ( mand @ ( dest @ paris ) @ ( class @ second ) ) @ ( price @ seventy ) ) ) )
= $true ),
inference(cnf_transformation,[],[f45]) ).
thf(f45,plain,
( ( mlocal @ ( mbox @ '#b_s' @ ( mimplies @ ( mand @ ( dest @ paris ) @ ( class @ second ) ) @ ( price @ seventy ) ) ) )
= $true ),
inference(fool_elimination,[],[f44]) ).
thf(f44,plain,
mlocal @ ( mbox @ '#b_s' @ ( mimplies @ ( mand @ ( dest @ paris ) @ ( class @ second ) ) @ ( price @ seventy ) ) ),
inference(rectify,[],[f12]) ).
thf(f12,axiom,
mlocal @ ( mbox @ '#b_s' @ ( mimplies @ ( mand @ ( dest @ paris ) @ ( class @ second ) ) @ ( price @ seventy ) ) ),
file('/export/starexec/sandbox/tmp/tmp.Bujw4kP5WJ/Vampire---4.8_32677',axiom_2) ).
thf(f73,plain,
! [X0: mworld,X1: mworld] :
( $true
= ( mrel @ '#b_s' @ X1 @ X0 ) ),
inference(cnf_transformation,[],[f51]) ).
thf(f51,plain,
! [X0: mworld,X1: mworld] :
( $true
= ( mrel @ '#b_s' @ X1 @ X0 ) ),
inference(fool_elimination,[],[f50]) ).
thf(f50,plain,
! [X0: mworld,X1: mworld] : ( mrel @ '#b_s' @ X1 @ X0 ),
inference(rectify,[],[f10]) ).
thf(f10,axiom,
! [X5: mworld,X2: mworld] : ( mrel @ '#b_s' @ X2 @ X5 ),
file('/export/starexec/sandbox/tmp/tmp.Bujw4kP5WJ/Vampire---4.8_32677','mrel_#b_s_universal') ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : NLP267^18 : TPTP v8.1.2. Released v8.1.0.
% 0.11/0.12 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.11/0.32 % Computer : n020.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Fri May 3 12:32:16 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.11/0.32 This is a TH0_THM_EQU_NAR problem
% 0.11/0.32 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/tmp/tmp.Bujw4kP5WJ/Vampire---4.8_32677
% 0.11/0.34 % (318)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.11/0.34 % (319)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.11/0.34 % (320)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.11/0.34 % (322)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.11/0.34 % (317)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.11/0.34 % (321)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.11/0.34 % (324)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.11/0.34 % (323)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.11/0.34 % (320)Instruction limit reached!
% 0.11/0.34 % (320)------------------------------
% 0.11/0.34 % (320)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34 % (320)Termination reason: Unknown
% 0.11/0.34 % (320)Termination phase: Property scanning
% 0.11/0.34
% 0.11/0.34 % (321)Instruction limit reached!
% 0.11/0.34 % (321)------------------------------
% 0.11/0.34 % (321)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34 % (320)Memory used [KB]: 1023
% 0.11/0.34 % (320)Time elapsed: 0.003 s
% 0.11/0.34 % (320)Instructions burned: 3 (million)
% 0.11/0.34 % (320)------------------------------
% 0.11/0.34 % (320)------------------------------
% 0.11/0.34 % (321)Termination reason: Unknown
% 0.11/0.34 % (321)Termination phase: Preprocessing 3
% 0.11/0.34
% 0.11/0.34 % (321)Memory used [KB]: 1023
% 0.11/0.34 % (321)Time elapsed: 0.003 s
% 0.11/0.34 % (321)Instructions burned: 3 (million)
% 0.11/0.34 % (321)------------------------------
% 0.11/0.34 % (321)------------------------------
% 0.11/0.34 % (324)Instruction limit reached!
% 0.11/0.34 % (324)------------------------------
% 0.11/0.34 % (324)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34 % (324)Termination reason: Unknown
% 0.11/0.34 % (324)Termination phase: Property scanning
% 0.11/0.34
% 0.11/0.34 % (324)Memory used [KB]: 1023
% 0.11/0.34 % (324)Time elapsed: 0.003 s
% 0.11/0.34 % (324)Instructions burned: 3 (million)
% 0.11/0.34 % (324)------------------------------
% 0.11/0.34 % (324)------------------------------
% 0.11/0.34 % (318)Instruction limit reached!
% 0.11/0.34 % (318)------------------------------
% 0.11/0.34 % (318)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34 % (318)Termination reason: Unknown
% 0.11/0.34 % (318)Termination phase: Property scanning
% 0.11/0.34
% 0.11/0.34 % (322)Refutation not found, incomplete strategy
% 0.11/0.34 % (322)------------------------------
% 0.11/0.34 % (322)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.34 % (322)Termination reason: Refutation not found, incomplete strategy
% 0.11/0.34
% 0.11/0.34
% 0.11/0.34 % (322)Memory used [KB]: 5500
% 0.11/0.34 % (322)Time elapsed: 0.003 s
% 0.11/0.34 % (322)Instructions burned: 3 (million)
% 0.11/0.34 % (322)------------------------------
% 0.11/0.34 % (322)------------------------------
% 0.11/0.34 % (318)Memory used [KB]: 1023
% 0.11/0.34 % (318)Time elapsed: 0.004 s
% 0.11/0.34 % (318)Instructions burned: 5 (million)
% 0.11/0.34 % (318)------------------------------
% 0.11/0.34 % (318)------------------------------
% 0.11/0.34 % (323)First to succeed.
% 0.11/0.35 % (317)Also succeeded, but the first one will report.
% 0.11/0.35 % (323)Refutation found. Thanks to Tanya!
% 0.11/0.35 % SZS status Theorem for Vampire---4
% 0.11/0.35 % SZS output start Proof for Vampire---4
% See solution above
% 0.11/0.35 % (323)------------------------------
% 0.11/0.35 % (323)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.11/0.35 % (323)Termination reason: Refutation
% 0.11/0.35
% 0.11/0.35 % (323)Memory used [KB]: 5628
% 0.11/0.35 % (323)Time elapsed: 0.010 s
% 0.11/0.35 % (323)Instructions burned: 12 (million)
% 0.11/0.35 % (323)------------------------------
% 0.11/0.35 % (323)------------------------------
% 0.11/0.35 % (316)Success in time 0.012 s
% 0.11/0.35 % Vampire---4.8 exiting
%------------------------------------------------------------------------------